Maximum likelihood estimator for hidden Markov models in continuous time
نویسندگان
چکیده
منابع مشابه
Maximum Likelihood Estimator for Hidden Markov Models in Continuous Time
The paper studies large sample asymptotic properties of the Maximum Likelihood Estimator (MLE) for the parameter of a continuous time Markov chain, observed in white noise. Using the method of weak convergence of likelihoods due to I.Ibragimov and R.Khasminskii [14], consistency, asymptotic normality and convergence of moments are established for MLE under certain strong ergodicity conditions o...
متن کاملMaximum-likelihood estimation for hidden Markov models
Hidden Markov models assume a sequence of random variables to be conditionally independent given a sequence of state variables which forms a Markov chain. Maximum-likelihood estimation for these models can be performed using the EM algorithm. In this paper the consistency of a sequence of maximum-likelihood estimators is proved. Also, the conclusion of the Shannon-McMillan-Breiman theorem on en...
متن کاملConsistency of the Maximum Likelihood Estimator for General Hidden Markov Models
Abstract. Consider a parametrized family of general hidden Markov models, where both the observed and unobserved components take values in a complete separable metric space. We prove that the maximum likelihood estimator (MLE) of the parameter is strongly consistent under a rather minimal set of assumptions. As special cases of our main result, we obtain consistency in a large class of nonlinea...
متن کاملOn Bahadur Efficiency of the Maximum Likelihood Estimator in Hidden Markov Models
In this paper, we study large deviations of maximum likelihood and related estimators for hidden Markov models. A hidden Markov model consists of parameterized Markov chains in a Markovian random environment, with the underlying environmental Markov chain viewed as missing data. A difficulty with parameter estimation in this model is the non-additivity of the log-likelihood function. Based on a...
متن کاملMaximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some complex pattern recognition tasks the choice of a good feature space may vary depending on the signal content. An example is in speech recognition where phone dependent feature subspaces may be useful. Handling multiple su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Inference for Stochastic Processes
سال: 2008
ISSN: 1387-0874,1572-9311
DOI: 10.1007/s11203-008-9025-4